Experimental study of path planning problem using EMCOA for a holonomic mobile robot
نویسندگان
چکیده
In this paper, a comparative study of the path planning problem using evolutionary algorithms, in comparison with classical methods such as A∗ algorithm, is presented for holonomic mobile robot. The configured navigation system, which consists integration sensors sources, map formatting, global and local planners, base controller, aims to enable robot follow shortest smooth delicately. Grid-based mapping used scoring paths efficiently, allowing determination collision-free trajectories from initial target position. This work considers mutated cuckoo optimization algorithm (MCOA) genetic (GA), planner find safe among others. A non-uniform motion coefficient introduced MCOA order increase performance algorithm. series experiments are accomplished analyzed confirm implemented on results show capacity framework respect under various obstacle layouts.
منابع مشابه
Mobile Robot Path Planning Using Genetic Algorithms
Genetic Algorithms (GAs) have demonstrated to be effective procedures for solving multicriterion optimization problems. These algorithms mimic models of natural evolution and have the ability to adaptively search large spaces in near-optimal ways. One direct application of this intelligent technique is in the area of evolutionary robotics, where GAs are typically used for designing behavioral c...
متن کاملPath Planning for a Mobile Robot Using Genetic Algorithms
This paper presents a new algorithm for global path planning to a goal for a mobile robot using Genetic Algorithm (GA). A genetic algorithm is used to find the optimal path for a mobile robot to move in a static environment expressed by a map with nodes and links. Locations of target and obstacles to find an optimal path are given in an environment that is a 2-D workplace. Each via point (landm...
متن کاملA Path-Planner for a non-holonomic Mobile Robot with Generic Shape using Multilayered CA
In this paper we present a Path-Planning Algorithm for a non-holonomic mobile robot with a generic shape. The robot we considered has to move using smoothed trajectories respecting a minimum steering radius constraint. We have developed an algorithm based on a directional (anisotropic) propagation of attracting potential values on a Multilayered Cellular Automata Model. The algorithm finds all ...
متن کاملPath planning of a mobile robot using genetic heuristics
A genetic algorithm for the path planning problem of a mobile robot which is moving and picking up loads on its way is presented. Assuming a findpath problem in a graph, the proposed algorithm determines a near-optimal path solution using a bit-string encoding of selected graph vertices. Several simulation results of specific task-oriented variants of the basic path planning problem using the p...
متن کاملPath Relaxation: Path Planning for a Mobile Robot
Path Relaxation is a method of planning safe paths around obstacles for mobile robots. It works in two steps: a global grid starch that finds a rough path, followed by a local relaxation step that adjusts each node on the path to lower the overall path cost. The representation used by Path Relaxation allows an explicit tradeoff among length of path, clearance away from obstacles, and distance t...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Chinese Journal of Systems Engineering and Electronics
سال: 2021
ISSN: ['1004-4132']
DOI: https://doi.org/10.23919/jsee.2021.000123